If Not Turing's Test, Then What?
نویسنده
چکیده
ence, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them good problems. This discovery process is necessarily empirical, so we examine several challenge problems, beginning with Turing’s famous test, and more than a dozen attributes that challenge problems might have. We are led to a contrast between research strategies—the successful “divide and conquer” strategy and the promising but largely untested “developmental” strategy—and we conclude that good challenge problems encourage the latter strategy.
منابع مشابه
What Is an Algorithm?
0 Preamble We present a two-part exposition on the notion of algorithm and foun-dational analyses of computation. The first part is below, and the second is here: In the first part, after a short introduction, we clarify some common misconceptions related to Turing's analysis of computation, consider whether the notion of algorithm can be rigorously defined in full generality, discuss what kind...
متن کاملK-graph machines : generalizing Turing's machines and arguments
The notion of mechanical process has played a crucial role in mathematical logic since the early thirties; it has become central in computer science, artificial intelligence, and cognitive psychology. But the discussion of Church's Thesis, which identifies the informal concept with a mathematically precise one, has hardly progressed beyond the pioneering work of Church, Godel, Post, and Turing....
متن کاملTuring Test Considered Harmful
Passing the Turing Test is not a sensible goal for Artificial Intelligence. Adherence to Turing's vision from 1950 is now actively harmful to our field. We review problems with Turing's idea, and suggest that, ironically, the very cognitive science that he tried to create must reject his research goal.
متن کاملRelating Turing's Formula and Zipf's Law
An asymptote is derived from Turing's local reestimation formula for population frequencies, and a local reestimation formula is derived from Zipf's law for the asymptotic behavior of population frequencies. The two are shown to be qualitatively different asymptotically, but nevertheless to be instances of a common class of reestimation-formula-asymptote pairs, in which they constitute the uppe...
متن کاملSelf-Organizing Topology Evolution of Turing Neural Networks
We present Turing's neural-network-like structures (unorganized machines) and compare them to Kau man's random boolean networks (RBN). Some characteristics of attractors are brie y presented. We then apply a self-organizing topology evolving algorithm to Turing's networks and show that the network evolves towards an average connectivity of KC = 2 for large systems (N !1).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- AI Magazine
دوره 26 شماره
صفحات -
تاریخ انتشار 2005